Explicit and efficient error estimation for convex minimization problems
نویسندگان
چکیده
We combine a systematic approach for deriving general posteriori error estimates convex minimization problems based on duality relations with recently derived generalized Marini formula. The are quasi constant-free and apply to large class of variational including the p p -Dirichlet problem, as well degenerate minimization, obstacle image de-noising problems. In addition, these comparison given non-conforming finite element solution. For bounds equivalent residual type and, hence, reliable efficient.
منابع مشابه
Random algorithms for convex minimization problems
This paper deals with iterative gradient and subgradient methods with random feasibility steps for solving constrained convex minimization problems, where the constraint set is specified as the intersection of possibly infinitely many constraint sets. Each constraint set is assumed to be given as a level set of a convex but not necessarily differentiable function. The proposed algorithms are ap...
متن کاملConvex Risk Minimization and Conditional Probability Estimation
This paper proves, in very general settings, that convex risk minimization is a procedure to select a unique conditional probability model determined by the classification problem. Unlike most previous work, we give results that are general enough to include cases in which no minimum exists, as occurs typically, for instance, with standard boosting algorithms. Concretely, we first show that any...
متن کاملGlobal Error Bounds for Convex Conic Problems
This paper aims at deriving and proving some Lipschitzian type error bounds for convex conic problems in a simple way First it is shown that if the recession directions satisfy Slater s condition then a global Lipschitzian type error bound holds Alternatively if the feasible region is bounded then the ordinary Slater condition guarantees a global Lipschitzian type error bound These can be consi...
متن کاملConvex minimization problems with weak constraint qualifications
One revisits the standard saddle-point method based on conjugate duality for solving convex minimization problems. Our aim is to reduce or remove unnecessary topological restrictions on the constraint set. Dual equalities and characterizations of the minimizers are obtained with weak or without constraint qualifications. The main idea is to work with intrinsic topologies which reflect some geom...
متن کاملLecture 5 Smooth convex minimization problems
To the moment we have more or less complete impression of what is the complexity of solving general nonsmooth convex optimization problems and what are the corresponding optimal methods. In this lecture we treat a new topic: optimal methods for smooth convex minimization. We shall start with the simplest case of unconstrained problems with smooth convex objective. Thus, we shall be interested i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics of Computation
سال: 2023
ISSN: ['1088-6842', '0025-5718']
DOI: https://doi.org/10.1090/mcom/3821